Convex Denoising using Non-Convex Tight Frame Regularization
نویسندگان
چکیده
منابع مشابه
Non-convex Sparse Regularization
We study the regularising properties of Tikhonov regularisation on the sequence space l with weighted, non-quadratic penalty term acting separately on the coefficients of a given sequence. We derive sufficient conditions for the penalty term that guarantee the well-posedness of the method, and investigate to which extent the same conditions are also necessary. A particular interest of this pape...
متن کاملRegularization With Non-convex Separable Constraints
We consider regularization of nonlinear ill-posed problems with constraints which are non-convex. As a special case we consider separable constraints, i.e. the regularization takes place in a sequence space and the constraint acts on each sequence element with a possibly non-convex function. We derive conditions under which such a constraint provides a regularization. Moreover, we derive estima...
متن کاملDigital Breast Tomosynthesis Reconstruction using Spatially Weighted Non-convex Regularization
Regularization is an effective strategy for reducing noise in tomographic reconstruction. This paper proposes a spatially weighted non-convex (SWNC) regularization method for digital breast tomosynthesis (DBT) image reconstruction. With a non-convex cost function, this method can suppress noise without blurring microcalcifications (MC) and spiculations of masses. To minimize the non-convex cost...
متن کاملConvex Non-convex Image Segmentation
A convex non-convex variational model is proposed for multiphase image segmen-tation. We consider a specially designed non-convex regularization term which adapts spatially tothe image structures for better controlling of the segmentation and easy handling of the intensityinhomogeneities. The nonlinear optimization problem is efficiently solved by an Alternating Direc-tions Meth...
متن کاملExact Regularization of Convex Programs
The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a certain selection problem has a Lagrange multiplier. Moreover, the regularization parameter thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2015
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2015.2432095